Formal orthogonal polynomials and Hankel/Toeplitz duality
نویسندگان
چکیده
منابع مشابه
Formal orthogonal polynomials and rational approximation for arbitrary bilinear forms
Classically, formal orthogonal polynomials are studied with respect to a linear functional, which gives rise to a moment matrix with a Hankel structure. Moreover, in most situations, the moment matrix is supposed to be strongly regular. This implies a number of algebraic properties which are well known, like for example the existence of a three-term recurrence relation (characterised by a tridi...
متن کاملDuality of Orthogonal Polynomials on a Finite Set
We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial ensemble. Introduction This note is about a certain duality of orthogonal polynomials defined on a finite set. If the weights of two systems of orthogonal p...
متن کاملComputing Zeros of Analytic Functions via Modiied Moments Based on Formal Orthogonal Polynomials Computing Zeros of Analytic Functions via Modiied Moments Based on Formal Orthogonal Polynomials Computing Zeros of Analytic Functions via Modified Moments Based on Formal Orthogonal Polynomials
We consider the problem of computing all the zeros of an analytic function that lie in the interior of a Jordan curve, together with their respective multiplicities. Our approach uses modiied moments based on formal orthogonal polynomials. Numerical experiments indicate that it is far superior to classical approaches, which consider the usually ill-conditioned map from the Newton sums to the un...
متن کاملSymmetric Orthogonal Polynomials and the Associated Orthogonal L-polynomials
We show how symmetric orthogonal polynomials can be linked to polynomials associated with certain orthogonal L-polynomials. We provide some examples to illustrate the results obtained. Finally as an application, we derive information regarding the orthogonal polynomials associated with the weight function (1 + kx2)(l x2)~1/2, k>0.
متن کاملMatching Polynomials And Duality
Let G be a simple graph on n vertices. An r-matching in G is a set of r independent edges. The number of r-matchings in G will be denoted by p(G,r). We set p(G,0)=1 and define the matching polynomial of G by μ(G,x):= ∑bn/2c r=0 (−1)·p(G,r)·x and the signless matching polynomial of G by μ(G,x):= ∑bn/2c r=0 p(G,r)·x. It is classical that the matching polynomials of a graph G determine the matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 1995
ISSN: 1017-1398,1572-9265
DOI: 10.1007/bf02140773